Solving the maximum duo-preservation string mapping problem with linear programming
نویسندگان
چکیده
منابع مشابه
Solving the maximum duo-preservation string mapping problem with linear programming
Article history: Received 27 November 2011 Received in revised form 12 February 2014 Accepted 16 February 2014 Communicated by V.Th. Paschos
متن کاملParameterized tractability of the maximum-duo preservation string mapping problem
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem. We show that this problem is fixed-parameter tractable when parameterized by the number k of conserved duos, by first giving a parameterized algorithm based on the color-coding technique and then presenting a reductio...
متن کاملRevisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping
In the Maximum-Duo Preservation String Mapping (Max-Duo PSM) problem, the input consists of two related strings A and B of length n and a nonnegative integer k. The objective is to determine whether there exists a mapping m from the set of positions of A to the set of positions of B that maps only to positions with the same character and preserves at least k duos, which are pairs of adjacent po...
متن کاملA 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem
This paper presents a simple 7/2-approximation algorithm for the max duo-preservation string mapping (MPSM) problem. This problem is complementary to the classical and well studied min common string partition problem (MCSP), that computes the minimal edit distance between two strings when the only operation allowed is to shift blocks of characters. The algorithm improves on the previously best ...
متن کاملA Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem
In the Maximum Duo-Preservation String Mapping problem we are given two strings and wish to map the letters of the former to the letters of the latter as to maximise the number of duos. A duo is a pair of consecutive letters that is mapped to a pair of consecutive letters in the same order. This is complementary to the well-studied Minimum Common String Partition problem, where the goal is to p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.02.017